K-Connection Maintenance Algorithm for Balanced Routing In Mobile Ad Hoc Networks

In this paper we propose a connection balanced routing in mobile ad-hoc networks (MANETs) using backbone update messages. Virtual-Backbone (VB) construction is very familiar, to overcome broadcast storm problem in wireless networks. In real time, during the movement of nodes in MANET, more number of nodes added in a particular node (say a VB node), it leads poor quality of service in multi-hop wireless environment. To overcome this problem connection balanced is required; in terms of reduction of nodes attachment in a backbone node and attach these nodes with new VB, to maintain connectivity. Most load balancing routing (LBR) protocols are based on reactive routing and evaluate the routes by weight, which depends on the traffic load information collected by each intermediate nodes. The collection of data for load information from all the nodes creates more delay and processing time, leads to extra overhead and result in performance degradation. Existing research works deals with construction of virtual backbone only, no one give the solution for connection overhead problem. To overcome this we propose a localized algorithm to support reducing the number of connection and maintain these connections by nearby VB nodes or identify the new VB for maintain the k-connections.our results are witnessed by simulation.